public class Test {
    public static void main(String[] args) {
        BinaryTree binaryTree=new BinaryTree();
        BinaryTree.TreeNode root=binaryTree.createTree();


        BinaryTree.TreeNode ret=binaryTree.lowestCommonAncestor(root,root.left.right.left,root.left.right.right);
        System.out.println(ret.val);
        //BinaryTree.TreeNode root = binaryTree.createTree();
        //注意 这里 给的字符串  一定要是一个 合法的前序遍历的字符串
//        String str = "ABC##DE#G##F###";
//        BinaryTree.TreeNode root = binaryTree.createTree(str);
//       // System.out.println(root);

        binaryTree.preOrder(root);
        System.out.println();

//        binaryTree.preorderTraversal(root);
//        System.out.println(root);
//
//        binaryTree.preOrder(root);
//        System.out.println();
//
//        binaryTree.inOrder(root);
//        System.out.println();
//
//        binaryTree.postOrder(root);
//        System.out.println();
//
//        System.out.println("节点的个数: "+ binaryTree.size2(root));
//        //System.out.println("叶子节点的个数: "+ BinaryTree.leafSize);
//        System.out.println("叶子节点的个数: "+ binaryTree.getLeafNodeCount2(root));
//        System.out.println("第K层节点的个数: "+ binaryTree.getKLevelNodeCount(root,4));
//        int ret = binaryTree.getHeight(root);
//        System.out.println("树的高度为："+ret);

//        BinaryTree.TreeNode ret2 = binaryTree.findVal(root,'D');
//        System.out.println(ret2.val);
    }
}
